翻訳と辞書 Words near each other ・ Shannon Welcome ・ Shannon Wheeler ・ Shannon Whirry ・ Shannon Willoughby ・ Shannon Wilson ・ Shannon Withem ・ Shannon Woodward ・ Shannon Worrell ・ Shannon Wright ・ Shannon Wynne ・ Shannon's Deal ・ Shannon's law ・ Shannon's law (Arizona) ・ Shannon's Mob ・ Shannon's Rainbow ・ Shannon's source coding theorem ・ Shannon's Way ・ Shannon, Alabama ・ Shannon, County Clare ・ Shannon, Georgia ・ Shannon, Illinois ・ Shannon, Kansas ・ Shannon, Kentucky ・ Shannon, Mississippi ・ Shannon, New Brunswick ・ Shannon, New Zealand ・ Shannon, North Carolina ・ Shannon, Quebec ・ Shannon, Texas ・ Shannon-class lifeboat Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Shannon's source coding theorem ： ウィキペディア英語版 Shannon's source coding theorem In information theory, Shannon's source coding theorem (or noiseless coding theorem) establishes the limits to possible data compression, and the operational meaning of the Shannon entropy. The source coding theorem shows that (in the limit, as the length of a stream of independent and identically-distributed random variable (i.i.d.) data tends to infinity) it is impossible to compress the data such that the code rate (average number of bits per symbol) is less than the Shannon entropy of the source, without it being virtually certain that information will be lost. However it is possible to get the code rate arbitrarily close to the Shannon entropy, with negligible probability of loss. The source coding theorem for symbol codes places an upper and a lower bound on the minimal possible expected length of codewords as a function of the entropy of the input word (which is viewed as a random variable) and of the size of the target alphabet. == Statements == ''Source coding'' is a mapping from (a sequence of) symbols from an information source to a sequence of alphabet symbols (usually bits) such that the source symbols can be exactly recovered from the binary bits (lossless source coding) or recovered within some distortion (lossy source coding). This is the concept behind data compression. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Shannon's source coding theorem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.